Static Watson-Crick regular grammar

Watson-Crick D0L systems with regular triggers

Exploring regular reversibility in Watson-Crick finite automata

Watson-Crick finite automata were inspired by formal language theory, finite states machines and some ingredients from DNA computing such as working with molecules as double stranded complementary strings. Here, we define different kinds of regular reversibility in this model. Mainly, we will explore regular reversibility in the upper (lower) strand and in the double strand.

Watson-Crick D0L Systems

D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...

Restricted deterministic Watson-Crick automata

In this paper, we introduce a new model of deterministic Watson-Crick automaton namely restricted deterministic WatsonCrick automaton which is a deterministic Watson-Crick automaton where the complementarity string in the lower strand is restricted to a language L. We examine the computational power of the restricted model with respect to L being in different language classes such as regular, u...

Multi-head Watson-Crick automata

Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce a new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of ...